Quantifying evenly distributed states in exclusion and nonexclusion processes.

نویسندگان

  • Benjamin J Binder
  • Kerry A Landman
چکیده

Spatial-point data sets, generated from a wide range of physical systems and mathematical models, can be analyzed by counting the number of objects in equally sized bins. We find that the bin counts are related to the Pólya distribution. New measures are developed which indicate whether or not a spatial data set, generated from an exclusion process, is at its most evenly distributed state, the complete spatial randomness (CSR) state. To this end, we define an index in terms of the variance between the bin counts. Limiting values of the index are determined when objects have access to the entire domain and when there are subregions of the domain that are inaccessible to objects. Using three case studies (Lagrangian fluid particles in chaotic laminar flows, cellular automata agents in discrete models, and biological cells within colonies), we calculate the indexes and verify that our theoretical CSR limit accurately predicts the state of the system. These measures should prove useful in many biological applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

متن کامل

Self-Stabilizing Distributed Local Mutual Exclusion

A self-stabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. The process identifiers are said to be chromatic if no two processes neighboring each other have th...

متن کامل

Uniform Randomized Self-Stabilizing Mutual Exclusion on Unidirectional Ring under Unfair C-Daemon

A distributed system consists of a set of processes and a set of communication links, each connecting a pair of processes. A distributed system is called self-stabilizing if it converges to a correct system state no matter which system state it is started with. A self-stabilizing system is considered to be an ideal fault tolerant system, since it can tolerate a nite number of transient failures...

متن کامل

A Universal Self - Stabilizing Mutual Exclusion Algorithm ∗ 3 Q @ nM 5 < ! 9 - EgBg

A distributed system consists of a set of processes and a set of communication links. A distributed system is said to be self-stabilizing if it converges to a correct system state from arbitrary initial system states. A self-stabilizing system is considered to be a fault tolerant system , since it tolerates any kind and any finite number of transient failures. The leader election and mutual exc...

متن کامل

A Universal Self - Stabilizing Mutual Exclusion Algorithm ∗ 3 Q @ nM 5 < ! 9 - EgBg 3

A distributed system consists of a set of processes and a set of communication links. A distributed system is said to be self-stabilizing if it converges to a correct system state from arbitrary initial system states. A self-stabilizing system is considered to be a fault tolerant system , since it tolerates any kind and any finite number of transient failures. The leader election and mutual exc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 83 4 Pt 1  شماره 

صفحات  -

تاریخ انتشار 2011